Alan Turing and the Riemann Zeta Function
نویسندگان
چکیده
Turing encountered the Riemann zeta function as a student, and developed a life-long fascination with it. Though his research in this area was not a major thrust of his career, he did make a number of pioneering contributions. Most have now been superseded by later work, but one technique that he introduced is still a standard tool in the computational analysis of the zeta and related functions. It is known as Turing’s method, and keeps his name alive in those areas. Of Turing’s two published papers [27, 28] involving the Riemann zeta function ζ(s), the second is the more significant. In it, Turing reports on the first calculation of zeros of ζ(s) ever done with the aid of an electronic digital computer. It was in developing the theoretical underpinnings for this work that Turing’s method first came into existence. Our primary aim in this chapter is to provide an overview of Turing’s work on the zeta function. The influence that interactions with available technology and with other researchers had on his thinking is deduced from [27, 28] as well as some unpublished manuscripts of his (available in [29]) and related correspondence, some newly discovered. (To minimize any overlap with other chapters, we do not discuss Turing’s contributions to computing
منابع مشابه
A more accurate half-discrete Hardy-Hilbert-type inequality with the best possible constant factor related to the extended Riemann-Zeta function
By the method of weight coefficients, techniques of real analysis and Hermite-Hadamard's inequality, a half-discrete Hardy-Hilbert-type inequality related to the kernel of the hyperbolic cosecant function with the best possible constant factor expressed in terms of the extended Riemann-zeta function is proved. The more accurate equivalent forms, the operator expressions with the norm, the rever...
متن کاملImprovements to Turing's method
This article improves the estimate of the size of the definite integral of S(t), the argument of the Riemann zeta-function. The primary application of this improvement is Turing’s Method for the Riemann zeta-function. Analogous improvements are given for the arguments of Dirichlet L-functions and of Dedekind zeta-functions.
متن کاملFP//LINSPACE computability of Riemann zeta function in Ko-Friedman model
In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function ζ(s) for all real s, s > 1, in polynomial time and linear space on Turing machines in Ko–Friedman model. The algorithms is based on a series expansion of real Riemann zeta function ζ(s) (the series globally convergents) and uses algorithms for the evaluation of real function (1 + x) h and hypergeo-m...
متن کاملZeroes of Zeta Functions and Symmetry
Hilbert and Polya suggested that there might be a natural spectral interpretation of the zeroes of the Riemann Zeta function. While at the time there was little evidence for this, today the evidence is quite convincing. Firstly, there are the “function field” analogues, that is zeta functions of curves over finite fields and their generalizations. For these a spectral interpretation for their z...
متن کاملHankel Determinants of Zeta Values
We study the asymptotics of Hankel determinants constructed using the values ζ(an + b) of the Riemann zeta function at positive integers in an arithmetic progression. Our principal result is a Diophantine application of the asymptotics.
متن کامل